Quantum image matching

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

improvement of terrasar-x image matching using textural image features

nowadays, sar imaging systems have become more interesting for scientists. high spatial resolution of recent sar images has become a key factor for their accurate applications such as interferometry, radargrammetry and change detection. in these applications, sar image matching procedure is a critical step for conjugate point extraction which is much more difficult than the optical images. the ...

متن کامل

Vehicle Logo Recognition Using Image Matching and Textural Features

In recent years, automatic recognition of vehicle logos has become one of the important issues in modern cities. This is due to the unlimited increase of cars and transportation systems that make it impossible to be fully managed and monitored by human. In this research, an automatic real-time logo recognition system for moving cars is introduced based on histogram manipulation. In the proposed...

متن کامل

Towards quantum template matching

We consider the problem of locating a template as a subimage of a larger image. Computing the maxima of the correlation function solves this problem classically. Since the correlation can be calculated with the Fourier transform this problem is a good candidate for a superior quantum algorithmic solution. We outline how such an algorithm would work.

متن کامل

Quantum Matching Pennies Game

A quantum version of the Matching Pennies (MP) game is proposed that is set in an Einstein-Podolsky-Rosen-Bohm (EPR-Bohm) setting. We construct the quantum game without using the state vectors and while considering only the quantum mechanical joint probabilities relevant to the EPR-Bohm setting. We embed the classical game within the quantum game such that the classical MP game results when the...

متن کامل

Quantum Pattern Matching

We propose a quantum algorithm for closest pattern matching which allows us to search for as many distinct patterns as we wish in a given string (database), requiring a query function per symbol of the pattern alphabet. This represents a significant practical advantage when compared to Grover’s search algorithm as well as to other quantum pattern matching methods [1], which rely on building spe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum Information Processing

سال: 2016

ISSN: 1570-0755,1573-1332

DOI: 10.1007/s11128-016-1364-2